<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/graph_algorithms/max_flow/ford_fulkerson/fordfulkerson_test.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('fordfulkerson__test_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">fordfulkerson_test.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="fordfulkerson__test_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef FORDFULKERSON_TEST</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define FORDFULKERSON_TEST</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&quot;src/google_test/gtest.h&quot;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="fordfulkerson_8h.html">fordfulkerson.h</a>&quot;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="graph_8h.html">src/graph_algorithms/basic_graph/graph_representation/graph/graph.h</a>&quot;</span></div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="bfs__vertex_8h.html">src/graph_algorithms/basic_graph/graph_representation/graph_vertex/bfs_vertex.h</a>&quot;</span></div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="keyword">using</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph.html">IntroductionToAlgorithm::GraphAlgorithm::Graph</a>;</div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="keyword">using</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_b_f_s___vertex.html">IntroductionToAlgorithm::GraphAlgorithm::BFS_Vertex</a>;</div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a23a29754883e1edd7bd95a76634444a2">IntroductionToAlgorithm::GraphAlgorithm::ford_fulkerson</a>;</div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a19237111c3b1ec2717c5e1aefe2f6d9b">IntroductionToAlgorithm::GraphAlgorithm::unlimit</a>;</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div>
<div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02fordfulkerson__test_8h_03.html">   30</a></span>&#160;<span class="keyword">namespace </span>{</div>
<div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02fordfulkerson__test_8h_03.html#aa80d7900226e7b387ace836fd821709e">   31</a></span>&#160;    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="namespaceanonymous__namespace_02fordfulkerson__test_8h_03.html#aa80d7900226e7b387ace836fd821709e">FF_N</a>= 6;  </div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;}</div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;</div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;</div>
<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="class_ford_fulkerson_test.html">   39</a></span>&#160;<span class="keyword">class </span><a class="code" href="class_ford_fulkerson_test.html">FordFulkersonTest</a>:<span class="keyword">public</span> ::testing::Test</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;{</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="class_ford_fulkerson_test.html#a58e2f6af86c26eced9f7b316c5fa5d88">   42</a></span>&#160;<span class="keyword">typedef</span> <a class="code" href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph.html">Graph&lt;FF_N,BFS_Vertex&lt;int&gt;</a>&gt; <a class="code" href="class_ford_fulkerson_test.html#a58e2f6af86c26eced9f7b316c5fa5d88">GType</a>; </div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;<span class="keyword">protected</span>:</div>
<div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="class_ford_fulkerson_test.html#af70f0b88d1d16cd50c76df0f98f706b0">   45</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_ford_fulkerson_test.html#af70f0b88d1d16cd50c76df0f98f706b0">SetUp</a>()</div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    {</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;</div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;        <span class="comment">//****  算法导论图26-6   ****</span></div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        <a class="code" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">_graph</a>=std::make_shared&lt;GType&gt;(0); <span class="comment">//边的无效权重为0</span></div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02fordfulkerson__test_8h_03.html#aa80d7900226e7b387ace836fd821709e">FF_N</a>;i++)</div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;            <a class="code" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">_graph</a>-&gt;add_vertex(0);</div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;        <a class="code" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">_graph</a>-&gt;add_edge(std::make_tuple(0,1,16));</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <a class="code" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">_graph</a>-&gt;add_edge(std::make_tuple(0,2,13));</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        <a class="code" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">_graph</a>-&gt;add_edge(std::make_tuple(1,3,12));</div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;        <a class="code" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">_graph</a>-&gt;add_edge(std::make_tuple(2,1,4));</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        <a class="code" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">_graph</a>-&gt;add_edge(std::make_tuple(2,4,14));</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;        <a class="code" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">_graph</a>-&gt;add_edge(std::make_tuple(3,2,9));</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        <a class="code" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">_graph</a>-&gt;add_edge(std::make_tuple(3,5,20));</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <a class="code" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">_graph</a>-&gt;add_edge(std::make_tuple(4,3,7));</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <a class="code" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">_graph</a>-&gt;add_edge(std::make_tuple(4,5,4));</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;    }</div>
<div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="class_ford_fulkerson_test.html#afcbc3160890661b9ae6d18a3a15bf6a6">   63</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_ford_fulkerson_test.html#afcbc3160890661b9ae6d18a3a15bf6a6">TearDown</a>(){}</div>
<div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">   64</a></span>&#160;    std::shared_ptr&lt;GType&gt; <a class="code" href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">_graph</a>;    </div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;};</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;</div>
<div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="fordfulkerson__test_8h.html#a4b9a48a6529d902fbcd316e4405d45f4">   72</a></span>&#160;<a class="code" href="fordfulkerson__test_8h.html#a4b9a48a6529d902fbcd316e4405d45f4">TEST_F</a>(<a class="code" href="class_ford_fulkerson_test.html">FordFulkersonTest</a>,test_ford_fulkerson)</div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;{</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    <span class="keyword">typedef</span> std::array&lt;std::array&lt;typename GType::EWeightType,FF_N&gt;,<a class="code" href="namespaceanonymous__namespace_02fordfulkerson__test_8h_03.html#aa80d7900226e7b387ace836fd821709e">FF_N</a>&gt; MatrixType;</div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;    MatrixType real_flow={std::array&lt;typename GType::EWeightType,FF_N&gt;({0,12,11,0,0,0}),\</div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;                            std::array&lt;typename GType::EWeightType,FF_N&gt;({0,0,0,12,0,0}),\</div>
<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;                            std::array&lt;typename GType::EWeightType,FF_N&gt;({0,0,0,0,11,0}),\</div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;                            std::array&lt;typename GType::EWeightType,FF_N&gt;({0,0,0,0,0,19}),\</div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;                            std::array&lt;typename GType::EWeightType,FF_N&gt;({0,0,0,7,0,4}),\</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;                            std::array&lt;typename GType::EWeightType,FF_N&gt;({0,0,0,0,0,0})};</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;    EXPECT_EQ(<a class="code" href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a23a29754883e1edd7bd95a76634444a2">ford_fulkerson</a>(_graph,0,5),real_flow);</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;}</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="preprocessor">#endif // FORDFULKERSON_TEST</span></div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;</div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_b_f_s___vertex_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_b_f_s___vertex.html">IntroductionToAlgorithm::GraphAlgorithm::BFS_Vertex</a></div><div class="ttdoc">BFS_Vertex：用于广度优先搜索的顶点类型，算法导论22章22.2节 </div><div class="ttdef"><b>Definition:</b> <a href="bfs__vertex_8h_source.html#l00042">bfs_vertex.h:42</a></div></div>
<div class="ttc" id="namespaceanonymous__namespace_02fordfulkerson__test_8h_03_html_aa80d7900226e7b387ace836fd821709e"><div class="ttname"><a href="namespaceanonymous__namespace_02fordfulkerson__test_8h_03.html#aa80d7900226e7b387ace836fd821709e">anonymous_namespace{fordfulkerson_test.h}::FF_N</a></div><div class="ttdeci">const int FF_N</div><div class="ttdef"><b>Definition:</b> <a href="fordfulkerson__test_8h_source.html#l00031">fordfulkerson_test.h:31</a></div></div>
<div class="ttc" id="bfs__vertex_8h_html"><div class="ttname"><a href="bfs__vertex_8h.html">bfs_vertex.h</a></div></div>
<div class="ttc" id="fordfulkerson_8h_html"><div class="ttname"><a href="fordfulkerson_8h.html">fordfulkerson.h</a></div></div>
<div class="ttc" id="class_ford_fulkerson_test_html_a58e2f6af86c26eced9f7b316c5fa5d88"><div class="ttname"><a href="class_ford_fulkerson_test.html#a58e2f6af86c26eced9f7b316c5fa5d88">FordFulkersonTest::GType</a></div><div class="ttdeci">Graph&lt; FF_N, BFS_Vertex&lt; int &gt; &gt; GType</div><div class="ttdef"><b>Definition:</b> <a href="fordfulkerson__test_8h_source.html#l00042">fordfulkerson_test.h:42</a></div></div>
<div class="ttc" id="class_ford_fulkerson_test_html"><div class="ttname"><a href="class_ford_fulkerson_test.html">FordFulkersonTest</a></div><div class="ttdoc">FordFulkersonTest:测试类，用于为测试提供基础数据 </div><div class="ttdef"><b>Definition:</b> <a href="fordfulkerson__test_8h_source.html#l00039">fordfulkerson_test.h:39</a></div></div>
<div class="ttc" id="class_ford_fulkerson_test_html_af70f0b88d1d16cd50c76df0f98f706b0"><div class="ttname"><a href="class_ford_fulkerson_test.html#af70f0b88d1d16cd50c76df0f98f706b0">FordFulkersonTest::SetUp</a></div><div class="ttdeci">void SetUp()</div><div class="ttdef"><b>Definition:</b> <a href="fordfulkerson__test_8h_source.html#l00045">fordfulkerson_test.h:45</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_graph_algorithm_html_a23a29754883e1edd7bd95a76634444a2"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a23a29754883e1edd7bd95a76634444a2">IntroductionToAlgorithm::GraphAlgorithm::ford_fulkerson</a></div><div class="ttdeci">std::array&lt; std::array&lt; typename GraphType::EWeightType, GraphType::NUM &gt;, GraphType::NUM &gt; ford_fulkerson(const std::shared_ptr&lt; GraphType &gt; graph, typename GraphType::VIDType src, typename GraphType::VIDType dst)</div><div class="ttdoc">ford_fulkerson：最大流的ford_fulkerson算法。算法导论26章26.2节 </div><div class="ttdef"><b>Definition:</b> <a href="fordfulkerson_8h_source.html#l00178">fordfulkerson.h:178</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_graph_algorithm_1_1_graph.html">IntroductionToAlgorithm::GraphAlgorithm::Graph</a></div><div class="ttdoc">Graph：图，算法导论22章22.1节 </div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00042">graph.h:42</a></div></div>
<div class="ttc" id="fordfulkerson__test_8h_html_a4b9a48a6529d902fbcd316e4405d45f4"><div class="ttname"><a href="fordfulkerson__test_8h.html#a4b9a48a6529d902fbcd316e4405d45f4">TEST_F</a></div><div class="ttdeci">TEST_F(FordFulkersonTest, test_ford_fulkerson)</div><div class="ttdoc">FordFulkersonTest:测试 ford_fulkerson 算法 </div><div class="ttdef"><b>Definition:</b> <a href="fordfulkerson__test_8h_source.html#l00072">fordfulkerson_test.h:72</a></div></div>
<div class="ttc" id="class_ford_fulkerson_test_html_a4c5c58e3ebc1d2d324c67a8a9afe19e3"><div class="ttname"><a href="class_ford_fulkerson_test.html#a4c5c58e3ebc1d2d324c67a8a9afe19e3">FordFulkersonTest::_graph</a></div><div class="ttdeci">std::shared_ptr&lt; GType &gt; _graph</div><div class="ttdef"><b>Definition:</b> <a href="fordfulkerson__test_8h_source.html#l00064">fordfulkerson_test.h:64</a></div></div>
<div class="ttc" id="graph_8h_html"><div class="ttname"><a href="graph_8h.html">graph.h</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_graph_algorithm_html_a19237111c3b1ec2717c5e1aefe2f6d9b"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_graph_algorithm.html#a19237111c3b1ec2717c5e1aefe2f6d9b">IntroductionToAlgorithm::GraphAlgorithm::unlimit</a></div><div class="ttdeci">T unlimit()</div><div class="ttdoc">unlimit：返回正无穷的函数 </div><div class="ttdef"><b>Definition:</b> <a href="header_8h_source.html#l00111">header.h:111</a></div></div>
<div class="ttc" id="class_ford_fulkerson_test_html_afcbc3160890661b9ae6d18a3a15bf6a6"><div class="ttname"><a href="class_ford_fulkerson_test.html#afcbc3160890661b9ae6d18a3a15bf6a6">FordFulkersonTest::TearDown</a></div><div class="ttdeci">void TearDown()</div><div class="ttdef"><b>Definition:</b> <a href="fordfulkerson__test_8h_source.html#l00063">fordfulkerson_test.h:63</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_aa0a5ddea82682e3e6fbdbaa3337ee0e.html">graph_algorithms</a></li><li class="navelem"><a class="el" href="dir_a4fbac2a12224e4d8b34a92a8974f6d5.html">max_flow</a></li><li class="navelem"><a class="el" href="dir_1fe642ec8116a9c108d1c569eba06e08.html">ford_fulkerson</a></li><li class="navelem"><a class="el" href="fordfulkerson__test_8h.html">fordfulkerson_test.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
